Polynomial-Size Binary Decision Diagrams for
ثبت نشده
چکیده
منابع مشابه
Genetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملOn the Relative Succinctness of Sentential Decision Diagrams
Sentential decision diagrams (SDDs) introduced by Darwiche in 2011 are a promising representation type used in knowledge compilation. The relative succinctness of representation types is an important subject in this area. The aim of the paper is to identify which kind of Boolean functions can be represented by SDDs of small size with respect to the number of variables the functions are defined ...
متن کاملApproximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables
Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
متن کاملRead-once Projections and Formal Circuit Verification with Binary Decision Diagrams
Computational complexity is concerned with the complexity of solving problems and computing functions and not with the complexity of verifying circuit designs. The importance of formal circuit veriication is evident. Therefore, a framework of a complexity theory for formal circuit veriication with binary decision diagrams is developed. This theory is based on read-once projections. For many pro...
متن کاملProbabilistic Equivalence Checking with Propositional DAGs
The canonical representation of Boolean functions offered by OBDDs (ordered binary decision diagrams) allows to decide the equivalence of two OBDDs in polynomial time with respect to their size. It is still unknown, if this holds for other more succinct supersets of OBDDs such as FBDDs (free binary decision diagrams) and d-DNNFs (deterministic, decomposable negation normal forms), but it is kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004